Finding Minimal Length Representatives in Thompson’s Group F

نویسنده

  • MICAH ISRAEL MILLER
چکیده

Cleary and Taback devised a method called the nested traversal method to construct minimal length representatives for positive and negative elements in Thomspson’s group. We show how to use the nested traversal method to construct minimal length representatives for a larger class of elements of this

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Seesaw words in Thompson’s group F

We describe a family of words in Thompson’s group F which present a challenge to the question of finding canonical minimal length representatives, and which show that F is not combable by geodesics. These words have the property that there are only two possible suffixes of long lengths for geodesic paths to the word from the identity; one is of the form g and the other of the form g where g is ...

متن کامل

Sean Cleary and Jennifer

We describe a family of elements in Thompson’s group F which present a challenge to finding canonical minimal length representatives for group elements, and which show that F is not combable by geodesics. These elements have the property that there are only two possible suffixes of long lengths for geodesic paths to these elements from the identity; one is of the form g and the other of the for...

متن کامل

Combinatorial and Metric Properties of Thompson’s Group T

We discuss metric and combinatorial properties of Thompson’s group T , including normal forms for elements and unique tree pair diagram representatives. We relate these properties to those of Thompson’s group F when possible, and highlight combinatorial differences between the two groups. We define a set of unique normal forms for elements of T arising from minimal factorizations of elements in...

متن کامل

Sean Cleary and Jennifer Taback

We study some combinatorial properties of the word metric of Thompson’s group F in the standard two generator finite presentation. We explore connections between the tree pair diagram representing an element w of F , its normal form in the infinite presentation, its word length, and minimal length representatives of it. We estimate word length in terms of the number and type of carets in the tr...

متن کامل

Unusual Geodesics in Generalizations of Thompson’s Group F

We prove that seesaw words exist in Thompson’s Group F (N) for N = 2, 3, 4, ... with respect to the standard finite generating set X. A seesaw word w with swing k has only geodesic representatives ending in g or g−k (for given g ∈ X) and at least one geodesic representative of each type. The existence of seesaw words with arbitrarily large swing guarantees that F (N) is neither synchronously co...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005